Computerized device for driving assistance

ABSTRACT

A computerized device for driving assistance comprises a memory (4) designed to receive data point cloud data (8) in which a point cloud associates, for a given instant, points each having coordinates in a plane associated with the point cloud and a value denoting a height. The device furthermore comprises a calculator (6) designed to access the memory (4) and, for a given point cloud, to calculate data on the probability of belonging to a reference surface, associated with each point of the data point cloud, on the one hand, and node data associating a value denoting a height (hi) and two values indicating a slope in a plane associated with the plane of the given point cloud, on the other hand, by determining a Gaussian random conditional field by way of the data point cloud data (8) corresponding to the given point cloud, which Gaussian random conditional field is represented by a mesh of nodes in said associated plane, which nodes are defined by the node data, and to return the data on the probability of belonging to a reference surface and/or at least some of the node data and values denoting a height.

The invention relates to the field of driving assistance. The field ofdriving assistance comprises assistance to fully autonomous vehicles andassistance to vehicles controlled with aids, with or without a driver.This field can also relate to other situations linked with driving, suchas management of the environment, be it on a road or in an industrialenvironment.

There are two principal families of technologies for autonomousvehicles: perceptive autonomous vehicles, that is to say those capableof getting their bearings in any environment, and aided autonomousvehicles, that is to say those which do not have any actual localperception of the environment. These two families are technically verydistinct, and call upon completely different technologies.

Beyond the distinct techniques, these families of vehicles can be usedin very different contexts. For example, a perceptive autonomous vehicleis unavoidable when there is little or no mapping of the environment ofuse, and/or when geolocalization in this environment is complex. This isthe case for example in numerous applications such as in the field ofagriculture or of industrial robotics. The notion of autonomous vehiclewill therefore be taken in a broad sense, that can cover cars as well astractors or other agricultural machine or a robot capable of moving.

The invention is more particularly concerned with the field ofperceptive autonomous vehicles. Conventionally, this type of vehicleuses means for analyzing its environment in order to define obstacles.Historically, these obstacles were detected by planar laser telemetry.

These technologies have evolved, and now integrate the 3D LIDAR or elsestereo cameras as telemetry source. This makes it possible to increasethe number of data points, and therefore the perception of theenvironment. However, this poses the problem that, among the data pointsdetected, many correspond to the ground, whilst in the previoustechniques, any datum point automatically designated an obstacle.

Techniques have therefore been developed in order to determine in apoint cloud obtained by LIDAR or another technique including the groundin the data points, those portions which correspond to the ground andthose portions which correspond to obstacles. The known techniques areeither accurate but not real-time (for example the currentimplementations using Markov conditional fields or MRF), or arecompatible with real-time use but are insufficiently accurate (forexample, by fitting of a plane on the ground).

The invention aims to improve the situation. To this effect, theinvention proposes a computerized device for driving assistance,comprising a memory designed to receive data point cloud data in which apoint cloud associates, for a given instant, points each exhibitingcoordinates in a plane associated with the point cloud and a valuedesignating a height.

The device furthermore comprises a calculator designed to access thememory and, for a given point cloud, to calculate on the one hand dataon the probability of belonging to a reference surface and which areassociated with each point of the data point cloud, and on the otherhand node data associating a value designating a height and two valuesindicating a slope in a plane associated with the plane of the givenpoint cloud, by determining a Gaussian conditional random field by meansof the data point cloud data corresponding to the given point cloud,which Gaussian conditional random field is represented by a mesh ofnodes in said associated plane, which nodes are defined by the nodedata, and to return the data on the probability of belonging to areference surface and/or some at least of the node data and valuesdesignating a height.

This device is particularly beneficial since it enables a distinction tobe made between ground and obstacles, as well as enabling a respectiveheight of the data points to be ascertained, with a calculational costthat is compatible with real-time use in an autonomous vehicle.

In other embodiments, the device will be able to exhibit one or more ofthe following additional characteristics:

-   -   the calculator is designed to apply a Gaussian conditional        random field comprising a first spatial component calculated,        for a given node, on the basis of a value derived from the        difference between the height of the given node and a height        calculated on the basis of the coordinates of the given node, of        the slope data of the given node and of the coordinates of the        points closest to the given node, and a second spatial component        calculated, for a given node, on the basis of a value derived        from the difference between the node data of the given node and        of node data calculated on the basis of the coordinates of the        given node, of the node data of the nodes closest to the given        node and of the coordinates of the nodes closest to the given        node,    -   the calculator is furthermore designed to apply a Gaussian        conditional random field comprising a temporal component        calculated, for a given node and a given instant, on the basis        of the node data of the given node and of the node data of the        given node at an instant preceding the given instant,    -   the calculator is designed to apply an expectation-maximization        algorithm to calculate the data on the probability of belonging        to a reference surface and the node data,    -   the calculator is designed, after an initialization step, to        apply the expectation-maximization algorithm by alternating an        expectation calculation step and a maximization calculation        step—the calculator is designed to execute the expectation        calculation step by updating the data on the probability of        belonging to a reference surface of a given point of the given        point cloud on the basis of a reference distance value derived        from the difference between the value designating a height of        the given point and of a height calculated on the basis of the        coordinates of the given point, of the coordinates of the node        closest to the given point and of the node data of the node        closest to the given point,    -   the calculator is designed to update data on the probability of        belonging to a reference surface of a given point of the given        point cloud as a function of the sign of the reference distance        value,    -   the calculator is designed to execute the maximization        calculation step by calculating on the one hand a vector of        information node data and information matrix data on the basis        of the first spatial component and of the second spatial        component, and    -   the calculator is furthermore designed to execute the        maximization calculation step on the basis of the temporal        component.

The invention also relates to a computing method for driving assistancewhich comprises the following operations:

a) receive data point cloud data in which a point cloud associates, fora given instant, points each exhibiting coordinates in a planeassociated with the point cloud and a value designating a height,

b) for a given point cloud, calculate on the one hand data on theprobability of belonging to a reference surface and which are associatedwith each point of the data point cloud, and on the other hand node dataassociating a value designating a height and two values indicating aslope in a plane associated with the plane of the given point cloud, bydetermining a Gaussian conditional random field by means of the datapoint cloud data corresponding to the given point cloud, which Gaussianconditional random field is represented by a mesh of nodes in saidassociated plane, which nodes are defined by the node data,

c) return the data on the probability of belonging to a referencesurface and/or some at least of the node data and values designating aheight.

In other embodiments, the method will be able to exhibit one or more ofthe following additional characteristics:

-   -   the Gaussian conditional random field comprises a first spatial        component calculated, for a given node, on the basis of a value        derived from the difference between the height of the given node        and a height calculated on the basis of the coordinates of the        given node, of the slope data of the given node and of the        coordinates of the points closest to the given node, and a        second spatial component calculated, for a given node, on the        basis of a value derived from the difference between the node        data of the given node and of node data calculated on the basis        of the coordinates of the given node, of the node data of the        nodes closest to the given node and of the coordinates of the        nodes closest to the given node,    -   the Gaussian conditional random field furthermore comprises a        temporal component calculated, for a given node and a given        instant, on the basis of the node data of the given node and of        the node data of the given node at an instant preceding the        given instant,    -   operation b) comprises the application of an        expectation-maximization algorithm to calculate the data on the        probability of belonging to a reference surface and the node        data,    -   operation b) comprises:        -   b1) an initialization step,        -   b2) an expectation calculation step, and        -   b3) a maximization calculation step,        -   steps b2) and b3) being repeated on the basis of the results            of the previous steps until a convergence condition is            fulfilled,    -   operation b2) comprises the updating of the data on the        probability of belonging to a reference surface of a given point        of the given point cloud on the basis of a reference distance        value derived from the difference between the value designating        a height of the given point and of a height calculated on the        basis of the coordinates of the given point, of the coordinates        of the node closest to the given point and of the node data of        the node closest to the given point,    -   operation b2) comprises the updating of the data on the        probability of belonging to a reference surface of a given point        of the given point cloud as a function of the sign of the        reference distance value,    -   operation b3) comprises the calculation of a vector of        information node data and of information matrix data on the        basis of the first spatial component and of the second spatial        component, and    -   the calculation of operation b3) comprises the use of the        temporal component.

Other characteristics and advantages of the invention will become betterapparent on reading the description which follows, derived from examplesgiven by way of nonlimiting illustration and derived from the drawingsin which:

FIG. 1 represents a schematic diagram of a device according to theinvention and of the data that it processes,

FIG. 2 represents a diagram as an example of the data model used by thedevice of FIG. 1 ,

FIG. 3 represents an example of an operating loop of the device of FIG.1 , and

FIG. 4 represents an exemplary implementation of a function of FIG. 3 .

The drawings and the description hereinafter contain, in essence,elements of a definite character. They will therefore be able not onlyto serve to better elucidate the present invention, but also tocontribute to its definition, if relevant.

The present description is of such a nature as to involve elementssusceptible of protection by author's rights and/or copyright. The ownerof the rights has no objection to the identical reproduction by anyoneof the present patent document or of its description, such as it appearsin the official records. For the remainder, he reserves his rights infull.

Furthermore, the detailed description is augmented by annex A, whichgives the formulation of certain mathematical formulae implementedwithin the framework of the invention. This Annex is set apart with theaim of clarification, and to facilitate cross-referencing. It is anintegral part of the description, and will therefore be able not only toserve to better elucidate the present invention, but also to contributeto its definition, if relevant.

Conditional random fields (hereinafter CRF) constitute an alternative toMRFs, but have no application in the sector of autonomous vehicles. Theyhave known a few uses, for example by Lu et al. in “A hybrid conditionalrandom field for estimating the underlying ground surface from airbornelidar data,” IEEE Transactions on Geoscience and Remote Sensing, vol.47, pp. 2913-2922, August 2009 or by Wang et al. in “A dynamicconditional random field model for object segmentation in imagesequences” in 2005 IEEE Computer Society Conference on Computer Visionand Pattern Recognition (CVPR '05), vol. 1, pp. 264-270 vol. 1, June2005.

Lu et al. relates to the characterization of a ground on the basis ofimages taken by an aerial LIDAR, by defining discrete random variableswhich represent whether or not a particular point belongs to the ground.This type of model is manifestly not compatible with autonomousvehicles, for which data acquisition is carried out much nearer to theground, a consequence of which is that more complex discrimination needsto be carried out, as well as the presence of masked parts, be it by thevehicle itself or by any obstacle in the line of sight of the sensor.Moreover, Lu et al. uses supervised learning to classify the obstacleswith the aid of extraction of characteristics, which is expensive andunsuitable for a navigation application with varied obstacles such asautonomous driving. Wang et al. is specific to the segmentation of imagesequences, thereby rendering it likewise inapplicable to the autonomousvehicle sector.

The Applicant has discovered a means of adapting CRFs to the context ofautonomous vehicles so as to discriminate in a point cloud those whichrelate to the ground, and those which belong to obstacles, and to do soin real-time. By real-time is meant a device which exhibits aneconomically reasonable calculation power and can be embedded on board avehicle, and is capable of processing the data points more rapidly thanthe frequency of acquisition of the data points.

FIG. 1 represents a schematic diagram of a device 2 according toinvention. The device 2 comprises a memory 4 and a calculator 6.

Within the framework of the invention, the memory 4 can be any type ofdata storage able to receive digital data: hard disk, flash memory harddisk (SSD), flash memory in any form, random-access memory, magneticdisk, locally distributed or cloud storage, etc. The data calculated bythe device can be stored on any type of memory similar to the memory 8,or on the latter. These data can be erased after the device hasperformed its tasks or preserved.

The memory 4 receives data point cloud data 8 at a frequencycorresponding to the acquisition frequency of the sensor of theautonomous vehicle in which the device 2 is installed. As a variant, thedevice 2 can be sited remotely and communicate with the autonomousvehicle by any appropriate means. The calculator 6 processes the pointcloud data and returns discriminated data point cloud data 10, in whicheach data point is identified as belonging to the ground or to anobstacle. In an optional manner, a height relative to the ground can beappended to each data point of the discriminated data point cloud. Thedata point cloud data 8, like the discriminated data point cloud data10, are ever coupled with a time marker, which makes it possible todetermine the moment at which the data acquisition was carried out. As avariant, the calculator 6 can also return an elevation map of the groundin the form of a grid of points, with the slope associated with eachpoint of the grid.

The calculator 6 is an element accessing the memory 4 directly orindirectly. It can be embodied in the form of an appropriate computercode executed on one or more processors. By processors must beunderstood any processor adapted to the calculations described below.Such a processor can be embodied in any known way, in the form of amicroprocessor for personal computer, of a dedicated microchip of FPGAor SoC (“system on chip”) type, of a calculation resource on a grid, ofa microcontroller, or of any other form able to provide the calculationpower necessary for the embodiment described below. One or more of theseelements can also be embodied in the form of specialized electroniccircuits such as an ASIC. A combination of processor and of electroniccircuits can also be envisaged.

FIG. 2 represents a diagram as an example of the data model used by thedevice of FIG. 1 . The Applicant has discovered that a spatio-temporalconditional random field (hereinafter STCRF) makes it possible to solvethe problems related with the discrimination of data point cloudsobtained at low altitude.

In the example described here, the ground is modeled in the form of aconditional random field represented by a mesh of nodes in atwo-dimensional plane centered on the vehicle.

Each node has inherent coordinates in this plane and is associated witha hidden continuous random variable in the form of a triplet comprisinga height, a slope in relation to a first axis of the two-dimensionalplane, and a slope in relation to a second axis of the two-dimensionalplane. Thus, for a node of index i and with coordinates nxi and nyi, thehidden continuous random variable is denoted Gi=(hi,sxi,syi)^(T). Themeasurements contained in the data point cloud data 8 represent tripletsof coordinates (xj, yj, zj) which are adapted to the frame of thetwo-dimensional plane.

The STCRF is based on three groups of interdependent neighborhoods:

-   -   The temporal neighborhood, which implies that one and the same        node must have the same classification in two consecutive        discriminated data point clouds,    -   The spatial neighborhood, which implies that nodes that are very        close spatially normally have similar heights, and    -   The real neighborhood, which comprises observations (for example        a prior classification of certain points and/or nodes) and        hidden variables (like the height of the points and/or nodes and        a probability of belonging to the ground).

Modeling via this STCRF makes it possible to determine, for each givenpoint, the value of the probability that it belongs to the ground, aswell as the height for the nodes of the mesh.

Thus, as may be seen in FIG. 2 , for a particular data point cloud, thedata of the STCRF are distributed over temporal planes 20 and 22. Thetemporal plane 20 represents the mesh for the particular data pointcloud, and the temporal plane 22 represents the mesh for the data pointcloud which is immediately prior to the particular data point cloud.

In the example described here the temporal neighborhood is thereforeformed, for a node 24 of the temporal plane 20 by the node 26 whichcorresponds to it in the temporal plane 22. The way in which account istaken of the displacement of the vehicle to determine the node 26 willbe explained below.

The node 24 is surrounded by a set of data points 28. As describedabove, each data point 28 has coordinates (xj, yj, zj) which represent ameasurement here obtained by LIDAR). A binary random variable cj isassociated with each measurement. As will be seen below, the device 2implements a calculation loop which makes it possible to evaluate thevalue of the variable cj. For the purposes of these calculations, eachdata point 28 is associated with the node Gi to which it is closestaccording to a metric measurement.

The three neighborhoods are united in a Gibbs distribution in the formof three equations [10], [20] and [30] of Annex A. Equation [10] relatesto the real neighborhood, equation [20] relates to the spatialneighborhood and equation [30] relates to the temporal neighborhood.

In equation [10], W1 is a normalization factor, α is a weighting factor,Mi designates the set of the data points which are associated with agiven node Gi, and Hij is a matrix defined by formula [15] of Annex A.Multiplying the matrix Hij by Gi amounts to estimating the height of thenode Gi at the data point of index j, taking account of the slope sxiand syi of Gi and of the distances between the node Gi and the datapoint of index j. Thus equation [10] determines a value derived from thedifference between the height of the measurement of each of the datapoints and the height that the closest node would have at these points,the variable cj influencing whether each data point is or is notassociated with the ground. In the example described here, the selectionof the data points of the real neighborhood is carried out by shiftingthe mesh grid and by centering it on the nodes Gi. Thus, each meshsquare contains the data points closest to the node Gi at the center ofthe mesh square considered.

In equation [20], W2 is a normalization factor, β is a weighting factor,Vi designates the set of the neighbor nodes of a given node Gi, and Fijis a matrix defined by formula [25] of Annex A. Applying the matrix Fijto Gj amounts to estimating the height of the node Gj at the location ofthe node of index i, taking account of the slope sxj and syj of Gj, andof the distances between the node Gj and the node Gi. Thus equation [20]determines a value derived from the difference between the height ofeach of the nodes and the height that the neighbor nodes would have atthese nodes. In the example described here, the spatial neighbors arethe 8 nodes closest to each given node. This gives a good compromisebetween number of iterations necessary to converge and amount ofcalculation necessary for each step. As a variant, the spatialneighborhood could be reduced to 4, or indeed 2 nodes, or greater than8. Still as a variant, equation [20] could comprise a weighting factorfor each neighbor node Gj, for example of the Gaussian kernel type.

In equation [30], W3 is a normalization factor, γ is a weighting factor,Qi designates a transition matrix of the node Gi for the data pointcloud immediately prior to the current data point cloud in the state ofthe node Gi for the current data point cloud. In the example describedhere, the matrix Qi is chosen equal to the identity matrix, but it couldbe different so as to introduce noise which would correspond to aconfidence interval for the measurements which made it possible tointerpolate the node Gi^(t-1) or so as to take account of a change inthe height of the ground over time (due for example to waves in amaritime application). To take account of the fact that the vehicle ismoving, the determination of the node Gi^(t-1) is done by transformingthe mesh of the data point cloud immediately prior to the current datapoint cloud as a function of the data in respect of the vehicle'sdisplacement and change of orientation. These data can be derived froman inertial measurement unit, and/or GPS data, and/or data of anodometer or other schemes using other sensors (visual odometry, SLAMlaser, etc.). The value of Gi^(t-1) is then calculated by interpolationof the transformed mesh at the location of the node Gi. For the nodesfor which no information was available, that is to say corresponding toa zone not visited by the vehicle, Gi^(t-1) is marked as undefined, sothat the pair Gi-Gi^(t-1) is not taken into account, while the zoneswhich disappear following the transformation can be discarded or storedin a long-term mapping. In other variants, the temporal neighborhoodcould include a node of an even older cloud. Nonetheless, the use of asingle temporal neighbor suffices to force coherence for the nodes whichare situated in a zone which has become blind because of the occurrenceof an obstacle such as another vehicle, or through the displacement ofthe autonomous vehicle itself. As a variant, the temporal neighborhoodand equation [30] could be omitted, on condition that loss of temporalcohesion is accepted and that dynamic shadow zones are experienced as afunction of the obstacles encountered.

The invention relies on the transformation of an a priori mesh into amesh which maximizes the a posteriori probability according to formula[40] of Annex A. Accordingly, each node is assigned a Gaussian model forthe state of the ground, each node Gi being represented by a mean vectorGmi and a covariance matrix Mi. To simplify the calculations, theserelations are rewritten with a matrix Pi which is the inverse of thecovariance matrix Mi and a vector Xi which is equal to the product ofthe matrix Pi and of the mean vector Gmi. Once the matrix Pi and thevector Xi have been determined, Gmi can be defined according to formula[50] of Annex A.

In order to approximate the full distribution over G, an iterativeexpectation-maximization algorithm is executed to determine the matrixPi and the vector Xi, in which the expectation step estimates theprobability distribution over the classification distribution of thedata points Ci, and a maximization step uses this distribution toestimate the distribution of state of the ground. These two steps arerepeated in a loop until a convergence condition is attained.

FIG. 3 represents an example of a function executed by the calculator 6to implement these calculations.

In an operation 300, the calculator 6 executes a function Init( ). Inthe example described, the starting mesh is flat. This functiontherefore initializes the vectors Gmi of G(0) with a zero height andslopes. This therefore also initializes X(0) to 0. On starting fromanother, non-flat, a priori mesh, the function Init( ) would initializethe vectors Gmi as a function of this other mesh. This initializationwill also be performed whenever a new node (that is to say a node at alocation which has not been processed in any of the previous loops) isdefined for a data point cloud, when the vehicle is moving. Thecovariance matrix Mi is initialized with significant diagonalcoefficients, so that these initialization values do not influence thefinal result of the algorithm but make it possible to accelerate itsconvergence.

A loop is then executed until the autonomous vehicle stops running, within an operation 310 the incrementation of an index t, in an operation320 the execution of a function Rec( ) which receives a current datapoint cloud and stores the corresponding measurements in a vector Z, andin an operation 330 the execution of a function EM( ) which determinesthe vector G(t) on receiving the vector Z and the vector G(t-1) of theprevious loop as arguments.

FIG. 4 represents an exemplary implementation of the function EM( ).

In an operation 400, the function EM( ) initializes by defining an indexi at 0 and an index k at 1, by determining P(t-1) and X(t-1) on thebasis of G(t-1) and by defining the current loop index t.

Two loops are then launched. The first loop traverses, for a given indexk, all the nodes of index i and updates the probability C[ ], the vectorX[i] and the matrix P[i]. The vector C[ ] therefore contains, for agiven index k, the probabilities of all the nodes of index i of thecurrent loop of index t. The second loop consists in repeating the firstloop with the updated nodes, therefore by varying the index k, until aconvergence condition is fulfilled.

10

Although the presentation of FIG. 4 is presented in iterative form,through the very nature of the calculations that they contain, theoperations of the first loop could be carried out in parallel. Statedotherwise, for a fixed index k, the first loop associated with eachindex i could be parallelized, and be for example executed all or inpart in parallel on a graphics processor, whose qualities are known forthese applications.

Thus, the probability C is updated in an operation 410 by a functionEst( ) which receives the vector Z and the vector X[i] as argument. Thefunction Est( ) selects the set of the data points of the vector Z whichare associated with the node of index i, and evaluates for each of thema probability cj that it stores in the vector C[k]. The probability cjis calculated according to formula [60] of Annex A. For the firstiteration of the function Est( ) when X[i](k-1,t) does not exist, it isX[i](t-1) which is used. In the case where the ground would beconsidered to be shifting temporally, this variation could be taken intoaccount and applied to X[i](t-1).

This formula amounts to determining a value derived from the distancebetween the measurement zj of a data point and the estimated height ofthe node Gmi displaced to the location of the data point. Theexponential with the factors σ1 and σ2 make it possible to convergerapidly toward 1 when the difference is close to zero. In the exampledescribed here, σ1 is fixed at 0.05 m and σ2 is fixed at 0.5 m. Thesevalues make it possible to give more importance to the data points whoseheight is small and makes it possible to converge for the low part ofthe obstacles (which are therefore not ground). As a variant, theformula when the difference of formula [60] of Annex A is negative couldfix a value of cj equal to 1.

Once the expectation step has terminated with the operation 410, themaximization step is executed with operations 420 and 430.

In the operation 420, a function XMax( ) receives the vector C[ ], thevector X[i](t-1) and the vector X[i](k-1,t) of the previous iteration aswell as the vector Z as arguments and updates the vector X[i] (k,t) ofthe current iteration by applying formula [70] of Annex A.

Formula [70] of Annex A amounts to undertaking a maximization offormulae [10], [20] and [30] for the vector X[i], their exponentialformulation allowing a linear formula in the presence of the Gaussianmodel.

In a similar manner, in the operation 430, a function PMax( ) receivesthe vector C[ ], the matrix P[i](t-1) and the matrix P[i](k-1,t) of theprevious iteration as well as the vector Z as arguments and updates thevector P[i](k,t) of the current iteration by applying formula [80] ofAnnex A.

Just as for formula [70] of Annex A, formula [80] of Annex A amounts toundertaking a maximization of formulae [10], [20] and [30] for thematrix P[i], their exponential formulation allowing a linear formula inthe presence of the Gaussian model.

In the example described here, the weighting factor α has been fixed at1, the weighting factor β has been fixed at 0.5, and the weightingfactor γ has been fixed at 0.2. These weighting factors could be fixedotherwise and correspond to the importance that it is desired to give tothe respective neighborhoods in the determination of the solution.

The index i is then tested to determine whether all the nodes have beenupdated for the loop of current index k in an operation 440. If this isnot the case, then the index i is incremented in an operation 450 andthe operations 410 to 440 are repeated.

When all the nodes have been updated, the estimation for the currentiteration of each vector Gmi, which are stored in a table G(k,t), iscalculated in an operation 460 which receives the current vector X(k,t)and the current matrix P(k,t) as arguments. This is carried out byapplying formula [90] of Annex A, which corresponds to the transpositionto the current iteration of formula [50] of Annex A.

Finally, a function Conv( ) is executed in an operation 470. Thefunction Conv( ) determines whether the function EM( ) has converged, orwhether it is necessary to undertake another iteration. Thisdetermination can be based on the number of iterations, the Applicanthaving noted that, for the parameters described hereinabove, 10iterations always suffice to converge, or on an inherent convergencecondition, for example comparison between G(k,t) and G(k-1,t).

When a new iteration is necessary, the index k is incremented in anoperation 480 and the index i is reset to zero in an operation 490, andthe loop resumes with the operation 410. Otherwise, the function EM( )terminates, returning the table G(k,t) in an operation 499.

The example described here has been validated with data point cloudsobtained by LIDAR, by means of a Velodyne HDL64 LIDAR mounted on aRenault Zoe as well as with 3 Ibeo Lux LIDARs. As a variant, othersources of point clouds could be used such as stereo cameras or depthcamera of Kinect type or others. Furthermore, to reduce thecalculations, the real neighborhood could be reduced by taking accountof the distance to the vehicle. Indeed, by nature, the LIDAR returns anenormous number of points near the vehicle, and then fewer and fewer asthe firing angle increases. As a variant, the number of neighbors couldbe preserved, but used to accelerate the convergence by forcing thecoherence of the nodes of the mesh with them. To accelerate theconvergence, the points which are very close to the vehicle could alsohave a height forced to that of the vehicle. Finally, the grid describedhere is square-patterned, but it could be adapted to the technology forcapturing the data point clouds, for example be a polar grid withcircular patterns.

$\begin{matrix}{{\Psi = {\frac{1}{W1}{\exp\left( {- {\sum_{i}{\alpha{\sum_{j \in {Mi}}{{cj}{{{zj} - {HijGj}}}^{2}}}}}} \right)}}}{{Hij} = \begin{bmatrix}1 & {{xi} - {nxi}} & {{yi} - {nyi}}\end{bmatrix}}{\Phi = {\frac{1}{W2}{\exp\left( {- {\sum_{i}{\beta{\sum_{j \in {Vi}}{{{Gi} - {FijGi}}}^{2}}}}} \right)}}}{{Hij} = \begin{bmatrix}1 & {{nxj} - {nxi}} & {{nyj} - {nyi}} \\0 & 1 & 0 \\0 & 0 & 1\end{bmatrix}}{\xi = {\frac{1}{W3}{\exp\left( {- {\sum_{i}{\gamma{{{Gi} - {QiGi}^{t - 1}}}^{2}}}} \right)}}}{\left\{ {gmi} \right\} = {\arg{\max_{gi}\left( {P\left( {{G = {\left\{ {gi} \right\} ❘C}},Z,G^{t - 1}} \right)} \right)}}}{{Gmi} = {{Pi}^{- 1}{Xi}}}{{cj} = \left\{ {{\begin{matrix}{{{\exp\left( {- \frac{\left( {{zi} - {{{HijX}\lbrack i\rbrack}\left( {{k - 1},t} \right)}} \right)^{2}}{2\sigma 1^{2}}} \right)}{if}\left( {{zi} - {{{HijX}\lbrack i\rbrack}\left( {{k - 1},t} \right)}} \right)} \geq 0} \\{{\exp\left( {- \frac{\left( {{zi} - {{{HijX}\lbrack i\rbrack}\left( {{k - 1},t} \right)}} \right)^{2}}{2\sigma 2^{2}}} \right)}{otherwise}}\end{matrix}{X\lbrack i\rbrack}\left( {k,t} \right)} = {{{\alpha{\sum_{j \in {Mi}}{cjzjHij}^{T}}} + {\beta{\sum_{j \in {Vi}}{{Fij}^{T}{X\lbrack j\rbrack}\left( {k,t} \right)}}} + {\gamma{Qi}^{T}{P\lbrack i\rbrack}\left( {t - 1} \right){P\lbrack i\rbrack}\left( {k,t} \right)}} = {{{\alpha{\sum_{j \in {Mi}}{{cjHij}^{T}{Hij}}}} + {\beta{\sum_{j \in {Vi}}{{Fij}^{T}{P\lbrack j\rbrack}\left( {k,t} \right){Fij}}}} + {\gamma{Qi}^{T}{P\lbrack i\rbrack}\left( {t - 1} \right){Qi}{{Gm}\lbrack i\rbrack}\left( {k,t} \right)}} = {{P\lbrack i\rbrack}\left( {k,t} \right)^{- 1}{X\lbrack i\rbrack}\left( {k,t} \right)}}}} \right.}} & {{Annex}A}\end{matrix}$

The invention claimed is:
 1. A computerized device for drivingassistance, comprising a memory designed to receive data points clouddata in which a point cloud associates, for a given instant (t), pointseach exhibiting coordinates (xi, yi) in a plane associated with thepoint cloud and a value designating a height (zi), each data pointbelonging to a reference surface (cj) or an obstacle, characterized inthat it furthermore comprises a calculator designed to access the memoryand, for a given point cloud, to calculate on the one hand data on theprobability of belonging to the reference surface (cj) and which areassociated with each point of the data point cloud, and on the otherhand nodes data (hi, sxi, syi) associating a value designating a height(hi) and two values indicating a slope (sxi, syi) in a plane associatedwith the plane of the given point cloud, by determining a Gaussianconditional random field (CRF) by means of the data points cloud datacorresponding to the given point cloud, which Gaussian conditionalrandom field (CRF) is represented by a mesh of nodes in said associatedplane, which nodes are defined by the nodes data (hi, sxi, syi), and toreturn the data on the probability of belonging to the reference surface(cj) and/or some at least of the nodes data (hi, sxi, syi) and of thevalues designating a height (zi), in which the Gaussian conditionalrandom field (CRF) comprises a first spatial component calculated, for agiven node (Gi), on the basis of a value derived from the differencebetween the height (hi) of the given node (Gi) and a height (HijGi)calculated on the basis of the coordinates of the given node (nxi, nyi),of the slope data (sxi, syi) of the given node (Gi) and of thecoordinates (xj, vj) of the closest points (Mi) to the given node (Gi),and a second spatial component calculated, for a given node (Gi), on thebasis of a value derived from the difference between the node data ofthe given node (Gi) and of node data (FijGj) calculated on the basis ofthe coordinates of the given node (nxi, nyi), of the node data (Gj) ofthe closest nodes (Vi) to the given node (Gi) and of the coordinates(xj, yj) of the closest nodes (Gj) to the given node (Gi).
 2. The deviceas claimed in claim 1, in which the Gaussian conditional random field(CRF) comprises a temporal component calculated, for a given node (Gi)and a given instant (t), on the basis of the node data of the given nodeand of the node data of the given node at an instant preceding the giveninstant (Gi(t-1)).
 3. The device as claimed in claim 1, in which thecalculator is designed to apply an expectation-maximization algorithm tocalculate the data on the probability of belonging to the referencesurface (cj) and the nodes data (hi, sxi, syi).
 4. The device as claimedin claim 3, in which the calculator is designed, after an initializationstep, to apply the expectation-maximization algorithm by alternating anexpectation calculation step and a maximization calculation step until aconvergence condition is fulfilled.
 5. The device as claimed in claim 4,in which the calculator is designed to execute the expectationcalculation step by updating the data on the probability of belonging tothe reference surface (cj) of a given point of the given point cloud onthe basis of a reference distance value (dzj) derived from thedifference between the value designating a height (zj) of the givenpoint and of a height (HijXi) calculated on the basis of the coordinatesof the given point (xj, yj), of the coordinates (nxi, nyi) of the nodeclosest to the given point and of the node data (hi, nxi, nyi, sxi, syi)of the node closest to the given point.
 6. The device as claimed inclaim 5, in which the calculator is designed to update data on theprobability of belonging to the reference surface (cj) of a given pointof the given point cloud as a function of the sign of the referencedistance value (dzj).
 7. The device as claimed in claim 6, in which thecalculator is designed to execute the maximization calculation step bycalculating on the one hand a vector of information node data (Xi(k,t))and information matrix data (Pi(k,t)) on the basis of the first spatialcomponent and of the second spatial component.
 8. The device as claimedin claim 7, in which the calculator is furthermore designed to executethe maximization calculation step on the basis of the temporalcomponent.
 9. A computing method for driving assistance, characterizedin that it comprises the following operations: a) receive data pointscloud data in which a point cloud associates, for a given instant (t),points each exhibiting coordinates (xi, yi) in a plane associated withthe point cloud and a value designating a height (zi), each data pointbelonging to a reference surface (ci) or an obstacle, b) for a givenpoint cloud, calculate on the one hand data on the probability ofbelonging to the reference surface (cj) and which are associated witheach point of the data point cloud, and on the other hand nodes data(hi, sxi, syi) associating a value designating a height (hi) and twovalues indicating a slope (sxi, syi) in a plane associated with theplane of the given point cloud, by determining a Gaussian conditionalrandom field (CRF) by means of the data points cloud data correspondingto the given point cloud, which Gaussian conditional random field (CRF)is represented by a mesh of nodes in said associated plane, which nodesare defined by the nodes data (hi, sxi, syi), c) return the data on theprobability of belonging to a reference surface (cj) and/or some atleast of the nodes data (hi, sxi, syi) and of the values designating aheight (zi), in which the Gaussian conditional random field (CRF)comprises a first spatial component calculated, for a given node (Gi),on the basis of a value derived from the difference between the height(hi) of the given node (Gi) and a height (HijGi) calculated on the basisof the coordinates of the given node (nxi, nyi), of the slope data (sxi,syi) of the given node (Gi) and of the coordinates (xj, yj) of theclosest points (Mi) to the given node (Gi), and a second spatialcomponent calculated, for a given node (Gi), on the basis of a valuederived from the difference between the node data of the given node (Gi)and of node data (FijGj) calculated on the basis of the coordinates ofthe given node (nxi, nyi), of the node data (Gj) of the closest nodes(Vi) to the given node (Gi) and of the coordinates (xj, yj) of theclosest nodes (Gj) to the given node (Gi).
 10. The method as claimed inclaim 9, in which the Gaussian conditional random field (CRF)furthermore comprises a temporal component calculated, for a given node(Gi) and a given instant (t), on the basis of the node data of the givennode (Gi) and of the node data of the given node (Gi) at an instantpreceding the given instant (Gi(t-1)).
 11. The method as claimed inclaim 9, further comprises application of an expectation-maximizationalgorithm to calculate the data on the probability of belonging to thereference surface (cj) and the nodes data (hi, sxi, syi).
 12. The methodas claimed in claim 11, in which the application of theexpectation-maximization algorithm comprises: an initialization step, anexpectation calculation step, and a maximization calculation step, theexpectation calculation step and the maximization calculation step beingrepeated on the basis of the results of the previous steps until aconvergence condition is fulfilled.
 13. The method as claimed in claim12, in which the expectation calculation step comprises the updating ofthe data on the probability of belonging to the reference surface (cj)of a given point of the given point cloud on the basis of a referencedistance value (dzj) derived from the difference between the valuedesignating a height (zj) of the given point and of a height (HijXi)calculated on the basis of the coordinates of the given point (xj, yj),of the coordinates (nxi, nyi) of the node closest to the given point andof the node data (hi, nxi, nyi, sxi, syi) of the node closest to thegiven point.